Generating locally cyclic triangulations of surfaces
نویسندگان
چکیده
منابع مشابه
Generating Irreducible Triangulations of Surfaces
Starting with the irreducible triangulations of a fixed surface and splitting vertices, all the triangulations of the surface up to a given number of vertices can be generated. The irreducible triangulations have previously been determined for the surfaces S0, S1, N1,and N2. An algorithm is presented for generating the irreducible triangulations of a fixed surface using triangulations of other ...
متن کاملTriangulations of surfaces
Triangulation is a convenient tool to consider when we are determining some properties of a topological space. Specifically, we can compute the homology and cohomology groups using the simplicial homology and cohomology of the triangulated space which is much easier than involving more complicated theories. In this paper, we will review the standard proof by Radó of the existence of triangulati...
متن کاملTriangulations of Surfaces
This paper uses an elementary surgery technique to give a simple topological proof of a theorem of Harer which says that the simplicial complex having as its top-dimensional simplices the isotopy classes of triangulations of a compact surface with a fixed set of vertices is contractible, except in a few special cases when it is homeomorphic to a sphere. (Triangulations here are allowed to have ...
متن کاملSurfaces over Arbitrary Triangulations
Recently in [7). a new multivariate B-spline scheme based on blending functions and control vertices was developed . This surface scheme allows CIo-1-continuous piecewise polynomial surfaces of degree k over arbitrary triangulations to be modelled . Actually, piecewise polynomial surfaces over a refined triangulation are produced given an arbitrary triangulation . The scheme exhibits both affin...
متن کاملk–MINIMAL TRIANGULATIONS OF SURFACES
A triangulation of a closed surface is k-minimal (k ≥ 3) if each edge belongs to some essential k-cycle and all essential cycles have length at least k. It is proved that the class of k-minimal triangulations is finite (up to homeomorphism). As a consequence it follows, without referring to the Robertson-Seymour’s theory, that there are only finitely many minor-minimal graph embeddings of given...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1992
ISSN: 0095-8956
DOI: 10.1016/0095-8956(92)90015-p